The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network
نویسندگان
چکیده
We prove the following results : (a) The Cube-Connected Cycles network of dimension n is a subgraph of the Butterry network of dimension n. (b) The Shuue-Exchange network of dimension n is a subgraph of the DeBruijn network of dimension n.
منابع مشابه
Some mathematical properties of cayley digraphs with applications to interconnection network design
We consider the relationships between Cayley digraphs and their coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting between them. We also derive a general factorization theorem on subgraphs of Cayley digraphs by their automorphism groups. We discuss the applications of these results to well-known interconnection networks such as the butterfly ...
متن کاملThe Minimum Spanner Problem on Butterfly Graphs
Given a connected graph G, a spanning subgraph G' of G is called a t-spanner if every pair of two adjacent vertices in G has a distance of at most t in G! A t-spanner of a graph G is minimum if it contains minimum number of edges among all t-spanners of G. Finding minimum spanners for general graphs is rather difzcult. Most of previous results were obtained for some particular graphs, e.g., but...
متن کاملAre Hopfield Networks Faster than Conventional Computers?
It is shown that conventional computers can be exponentiallx faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to converge, a stable state of an arbitrary planar Hopfield network can be found by a conventional computer in polynomial time. The theory of 'P.cS-completeness gives strong evidence that such a separation is unlikely for nonpl...
متن کاملBroadcasting and Scattering in Cube-connected Cycles and Butterfly Networks
The process of sending a message from one node of a communication network to all other nodes is called broadcasting when the message is the same for all nodes and scattering when each of the nodes receives a different message. In this thesis we prove several upper bounds on the time to broadcast and scatter in the Cube-Connected Cycles (CCCd) and Butterfly (BFd) interconnection networks. We use...
متن کاملMinimum Feedback Vertex Sets in Shuffle-based Interconnection Networks
Given a graph G, the problem is to construct a smallest subset S of vertices whose deletion results in an acyclic subgraph. The set S is called a minimum feedback vertex set for G. Tight upper and lower bounds on the cardinality of minimum feedback vertex sets have been obtained for some hypercube–like networks, such as meshes, tori, butterflies, cube-connected cycles and hypercubes. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 2 شماره
صفحات -
تاریخ انتشار 1992